Integrated Scheduling Algorithm of Complex Product with No-wait Constraint Based on Virtual Component
نویسندگان
چکیده
منابع مشابه
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملHeuristic algorithm for scheduling in the no-wait ̄ow-shop
Sequencing and scheduling are forms of decision making which play a key role in manufacturing. This paper presents the description of a scheduling algorithm for the solution of the no-wait ̄ow-shop problem. The goal of the heuristic is to minimise the sum of the total ̄owtimes, a criterion which at the same time minimises the average processing time. This is a sensible target in applications su...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملNo-wait flexible flowshop scheduling with no-idle machines
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mechanical Engineering
سال: 2020
ISSN: 0577-6686
DOI: 10.3901/jme.2020.04.246